Quantum Algorithms for Graph Traversals and Related Problems
نویسنده
چکیده
We study the complexity of algorithms for graph traversal problems on quantum computers. More precisely, we look at eulerian tours, hamiltonian tours, travelling salesman problem and project scheduling. We present quantum algorithms and quantum lower bounds for these problems. Our results improve the best classical algorithms for the corresponding problems. In particular, we prove that the quantum algorithms for the eulerian tour and the project scheduling problem are optimal in the query model.
منابع مشابه
Mining Weighted Frequent Patterns from Path Traversals on Weighted Graph
A lot of real world problems can be modeled as traversals on graph, and mining from such traversals has been found useful in several applications. However, previous works considered only traversals on unweighted graph. This paper generalizes this to the case where vertices of graph are given weights to reflect their importance. Under such weight settings, traditional mining algorithms can not b...
متن کاملEulerian tour algorithms for data visualization and the PairViz package
PairViz is an R package that produces orderings of statistical objects for visualization purposes. We abstract the ordering problem to one of constructing edge-traversals of (possibly weighted) graphs. PairViz implements various edge traversal algorithms which are based on Eulerian tours and Hamiltonian decompositions. We describe these algorithms, their PairViz implementation and discuss their...
متن کاملTemporal Graph Traversals: Definitions, Algorithms, and Applications
A temporal graph is a graph in which connections between vertices are active at specific times, and such temporal information leads to completely new patterns and knowledge that are not present in a non-temporal graph. In this paper, we study traversal problems in a temporal graph. Graph traversals, such as DFS and BFS, are basic operations for processing and studying a graph. While both DFS an...
متن کاملBQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems
Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...
متن کاملA Modular and Statically Typed Effectful Stack for Custom Graph Traversals
Programmers often have to implement custom graph traversals by hand as either there are no suitable text-book algorithms for their tasks, or their problems are too complex for a pure querying language that lacks modularity or static typing. Our new Scala-based graph traversal language uses an effectful stack that adapts monads and type classes. Arbitrary graph effect computations and graph proc...
متن کامل